On parameterized exponential time complexity
نویسندگان
چکیده
منابع مشابه
On Parameterized Exponential Time Complexity
In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2o(f (k))p(n) time if and only if it is solvable in time O(2δf (k)q(n)) for any constant δ > 0, where p and q are polynomials. We then illustrate how this equivalence can be used to show that special instances of parameterized NP-hard problems are a...
متن کاملA note on parameterized exponential time complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2p(n)) time if and only if it has an f(k)-uniform parameterized exponential time scheme (p is a polynomial). We then illustrate how our formulation can be used to show that special instances of parameterized NPhard problems are as difficult as the ...
متن کاملParameterized Complexity and Subexponential Time
Parameterized Complexity in its origins was considered by many researchers to be an exotic research eld, orthogonal to the standard way of classifying problems in complexity theory. In the last years however many surprising connections between Parameterized Complexity and classical areas in complexity theory have been established. Jörg Flum and Martin Grohe survey in this column some of these i...
متن کاملParameterized Complexity: Exponential Speed-Up for Planar Graph Problems
We discuss general techniques, centered around the “Layerwise Separation Property” (LSP) of a planar graph problem, that allow to develop algorithms with running time c √ k|G|, given an instance G of a problem on planar graphs with parameter k. Problems having LSP include planar vertex cover, planar independent set, and planar dominating set. Extensions of our speed-up technique to basically al...
متن کاملPolynomial Time Approximation Schemes and Parameterized Complexity
In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.03.006